Categoricity Without Equality
نویسندگان
چکیده
We study categoricity in power for reduced models of first order logic without equality.
منابع مشابه
Categoricity Spectra for Rigid Structures
For a computable structure M , the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of M . If the spectrum has a least degree, this degree is called the degree of categoricity of M . In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures wi...
متن کاملComputable Categoricity versus Relative Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1-decidable computably categorical structure is relatively ∆2-categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also...
متن کاملCompleteness and Categoricity (in power): Formalization without Foundationalism
We propose a criterion to regard a property of a theory (in first or second order logic) as virtuous: the property must have significant mathematical consequences for the theory (or its models). We then rehearse results of Ajtai, Marek, Magidor, H. Friedman and Solovay to argue that for second order logic, ‘categoricity’ has little virtue. For first order logic, categoricity is trivial; but ‘ca...
متن کاملOn Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. In particular, we show that every 1-decidable computably categorical structure is relatively ∆2-categorical, but that there is a computably categorical structure that is not even relatively arithmetically categorical. We also...
متن کاملCategoricity Properties for Computable Algebraic Fields
We examine categoricity issues for computable algebraic fields. Such fields behave nicely for computable dimension: we show that they cannot have finite computable dimension greater than 1. However, they behave less nicely with regard to relative computable categoricity: we give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is ...
متن کامل